A Uniform Set Covering Lemma
نویسندگان
چکیده
منابع مشابه
Lebesgue’s Covering Lemma, Uniform Continuity and Segmentation of Arcs
For mappings from a metric space to a metric space, a notion of uniform continuity is defined. If we introduce natural topologies to the metric spaces, a uniformly continuous function becomes continuous. On the other hand, if the domain is compact, a continuous function is uniformly continuous. For this proof, Lebesgue’s covering lemma is also proved. An arc, which is homeomorphic to [0,1], can...
متن کاملA Covering Lemma for Rectangles in R
We prove a covering lemma for rectangles in Rn which has connections to a problem of Zygmund and its solution in three dimensions by Cordoba. One of the objectives of this note is to revive interest in a collection of problems in differentiation theory related to a conjecture of Zygmund. We shall also give another proof of the sharp mapping properties near L of the strong maximal operator by pr...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA Set and Collection Lemma
A set S ⊆ V (G) is independent if no two vertices from S are adjacent. Let α (G) stand for the cardinality of a largest independent set. In this paper we prove that if Λ is a nonempty collection of maximum independent sets of a graph G, and S is an independent set, then • there is a matching from S − ⋂ Λ into ⋃ Λ− S, and • |S|+ α(G) 6 ∣∣∣⋂Λ ∩ S∣∣∣+ ∣∣∣⋃Λ ∪ S∣∣∣. Based on these findings we provi...
متن کاملCovering Non-uniform Hypergraphs
A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) denote the cardinality of a minimum cover in the hypergraph H , and let us denote by g(n) the maximum of τ(H) taken over all hypergraphs H with n vertices and with no two hyperedges of the same size. We show that g(n) < 1.98 √ n(1 + o(1)). A special case corresponds to an old problem of Erdős asking the ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1975
ISSN: 0002-9939
DOI: 10.2307/2040728